On Low Weight Codewords of Generalized Affine and Projective Reed - Muller Codes ( Extended abstract )
نویسندگان
چکیده
We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we give some results on codewords that cannot reach the second weight also called the next to minimal distance. In the projective case the second distance of generalized Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
منابع مشابه
On low weight codewords of generalized affine and projective Reed-Muller codes
We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight codewords are products of affine functions. Then in the general case we study some types of codewords and prove that they cannot be second, thirds or fourth weig...
متن کاملRemarks on low weight codewords of generalized affine and projective Reed-Muller codes
A brief survey on low weight codewords of generalized Reed-Muller codes and projective generalized Reed-Muller codes is presented. In the affine case some information about the words that reach the second distance is given. Moreover the second weight of the projective Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
متن کاملA new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.
متن کاملA new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller code
We give a new proof of Delsarte, Goethals and Mac williams theorem on minimal weight codewords of generalized Reed-Muller codes published in 1970. To prove this theorem, we consider intersection of support of minimal weight codewords with affine hyperplanes and we proceed by recursion.
متن کاملOn the third weight of generalized Reed-Muller codes
In this paper, we study the third weight of generalized Reed-Muller codes. Using results from [6], we prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of small order with two variables. In some cases, we are able to determine the third weight and the third weight codewords of generalized Re...
متن کامل